Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
191	Microsoft Word - fp16-armoni.doc Add to Reading List Source URL: www.openu.ac.il Language: English - Date: 2009-03-16 13:42:11 Computational complexity theory Cognition Neuropsychology Structural complexity theory Mathematics Reduction Problem solving Algorithm Heuristic How to Solve It Computational thinking
192	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-02-25 05:09:48 Cryptography Computational complexity theory Theory of computation Complexity classes Probabilistic complexity theory Public-key cryptography NP IP Proof of knowledge Zero-knowledge proof Random oracle FiatShamir heuristic
193	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
194	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
195	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
196	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
197	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem
198	Average Vehicle Count Technician Name: administratortoLocation: Add to Reading List Source URL: www.southbethany.org Language: English - Date: 2016-07-26 11:18:11 Analysis of algorithms Best worst and average case Computational complexity theory
199	The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-11-17 17:17:16 Mathematics Combinatorics Combinatorial optimization Matroid theory Discrete mathematics Matroid Greedoid Partition matroid Matroid oracle

UPDATE